Constraint Satisfaction Using A Hybrid Evolutionary Hill-Climbing Algorithm That Performs Opportunistic Arc and Path Revision
نویسندگان
چکیده
This paper introduces a hybrid evolutionary hillclimbing algorithm that quickly solves (!onstraint, Satisfaction Problems (CSPs). This hybrid uses opportunistic arc and path revision in an interleaved fashion to reduce the size of the search space and to realize when to quit if a CSP is based on an inconsistent, constraint network. This hybrid out,performs a well known hill-climbing algorithm, the Iterat,ive Descent. Method, on a test suit,e of 750 randomly generated (3Ps.
منابع مشابه
A Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem
This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...
متن کاملA Comparison of Traditional and Simple Evolutionary Hill-Climbing Methods for Solving Static and Recurrent Dynamic Constraint Satisfaction Problems
In this paper we compare the performance of Minton’s et al. min-conflicts hill-climbing (MCHC) algorithm [16], Wallace and Freuder’s MCHC algorithm [25], Morris’ breakout algorithm (BA) [17, 18], and modified variants of the BA that we developed on static constraint satisfaction problems (CSPs) and recurrent dynamic constraint satisfaction problems (rDCSPs). Also, we used a simple evolutionary ...
متن کاملFinding collisions for MD4 hash algorithm using hybrid algorithm
The modification of message that meets the sufficient conditions for collision is found in the last step of differential attack proposed by Wang et all. (2005) on MD4 hash algorithm. Here we show how this attack phase, finding a collision starting from the list of sufficient conditions for the collision, can be implemented using a combination of two algorithms evolutionary algorithm and hill cl...
متن کاملA Comparison of Hill-Climbing Methods for Solving Static and Recurrent Dynamic Constraint Satisfaction Problems
In this paper we compare the performance of Minton’s et al. min-conflicts hill-climbing (MCHC) algorithm [8], Wallace and Freuder’s MCHC algorithm [18], Morris’ breakout algorithm (BA) [9, 10], and modified variants of the BA that we developed on static constraint satisfaction problems and recurrent dynamic constraint satisfaction problems (CSPs & rDCSPs). In this study, our results show that t...
متن کاملA Comparison of Evolutionary Algorithms for Tracking Time-Varying Recursive Systems
A comparison is made of the behaviour of some evolutionary algorithms in time-varying adaptive recursive filter systems. Simulations show that an algorithm including random immigrants outperforms a more conventional algorithm using the breeder genetic algorithm as the mutation operator when the time variation is discontinuous, but neither algorithms performs well when the time variation is rapi...
متن کامل